Proving Lower Bounds Via Pseudo-random Generators
نویسنده
چکیده
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P 6= NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits.
منابع مشابه
General Pseudo-random Generators from Weaker Models of Computation
The construction of pseudo-random generators (PRGs) has been based on strong assumptions like the existence of one-way functions or exponential lower bounds for the circuit complexity of Boolean functions. Given our current lack of satisfactory progress towards proving these assumptions, we study the implications of constructing PRGs for weaker models of computation to the derandomization of ge...
متن کاملComputational Pseudo-Randomness
One of the most important and fundamental discoveries of Theoretical Computer Science is the surprising connection between the computational power of randomness, and computational lower bounds on explicit functions. The currently strongest result of this form states [l] : Theorem 1 If EXP has no subexponentially small circuits then BPP had determinastic, pseudo-polynomial time algorithms. The k...
متن کاملSeparating NOF communication complexity classes RP and NP
In the number-on-forehead (NOF) model of communication complexity, k players are trying to evaluate a function F defined on kn bits. The input of F is partitioned into k pieces of n bits each, call them x1, . . . ,xk, and xi is placed, metaphorically, on the forehead of player i. Thus, each player sees (k − 1)n of the kn input bits. The players communicate by writing bits on a shared blackboard...
متن کاملSimple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-co...
متن کاملUsing GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Recently, it was shown that using GLFSRs as pattern generators for pseudo-random logic tests can increase the fault coverage noticeably in comparison to standard pseudo-random test pattern generators. Since memory faults d...
متن کامل